Arithmetic Coding in Parallel

نویسندگان

  • Jan Supol
  • Borivoj Melichar
چکیده

We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Algorithms for Entropy-Coding Techniques

With the explosion of imaging applications, and due to the massive amounts of imagery data, data compression is essential. Lossless compression, also called entropy coding, is of special importance because not only it serves as a stand-alone system for certain applications such as medical imaging, it also is an inherent part of lossy compression. Therefore, fast entropy coding/decoding algorith...

متن کامل

Arithmetic Coding for Data Compression

Arithmetic coding provides an e ective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an e cient implementation that uses table lookup as a fast alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible e ect on the amount of compression achieved. We can speed up the implementation further by use...

متن کامل

Two-Stage Algorithm for Data Compression

This paper proposes two stage algorithm that carries advantages of PDLZW and Arithmetic coding and compares its performance with deflate which is a well-known two-stage algorithm that combines the features of LZ77 and Huffman Coding. The PDLZW is designed by partitioning the dictionary into several dictionaries of different address spaces and sizes. With the hierarchical parallel dictionary set...

متن کامل

ECE 734 VLSI ARRAY STRUCTURES FOR DIGITAL SIGNAL PROCESSING (SPRING 2009) Kolluru

This work discusses about the optimization of MQ coding using ARM architecture and optimization of Arithmetic Coding for parallel processing. The former involves the optimization of the algorithm using the features of the platform while the latter involves optimizing with respect to the algorithm. The work also presents a novel idea of reformulating the Sequential Arithmetic Coding for Parallel...

متن کامل

A High-Speed Dual-Bit Parallel Adder based on Carbon Nanotube ‎FET technology for use in arithmetic units

In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2004